On the Descriptional Complexity of Operations on Semilinear Sets
نویسندگان
چکیده
We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear set are: (i) the maximal value that appears in the vectors of periods and constants and (ii) the number of such sets of periods and constants necessary to describe the semilinear set under consideration. More precisely, we prove upper bounds on the union, intersection, complementation, and inverse homomorphism. In particular, our result on the complementation upper bound answers an open problem from [G. J. Lavado, G. Pighizzini, S. Seki: Operational State Complexity of Parikh Equivalence, 2014]. E-mail: [email protected] E-mail: [email protected] E-mail: [email protected] Copyright c © 2017 by the authors
منابع مشابه
Language Operations with Regular Expressions of Polynomial Size
In the last 20 years, a large body of research on the descriptional complexity of finite automata has been developed. To the authors’ knowledge, the first systematic attempt to start a parallel development for the descriptional complexity of regular expressions was presented by Ellul et al. [4] at the workshop “Descriptional Complexity of Formal Systems” (DCFS), in 2002. In particular, they rai...
متن کاملNonterminal Complexity of Some Operations on Context-Free Languages
We investigate context-free languages with respect to the measure Var of descriptional complexity, which gives the minimal number of nonterminals which is necessary to generate the language. Especially, we consider the behaviour of this measure with respect to operations. For given numbers c1, c2, . . . , cn and an nary operation τ on languages we discuss the range of Var(τ(L1, L2, . . . , Ln))...
متن کاملDescriptional Complexity of Deterministic Regular Expressions
We study the descriptional complexity of regular languages that are definable by deterministic regular expressions. First, we examine possible blow-ups when translating between regular expressions, deterministic regular expressions, and deterministic automata. Then we give an overview of the closure properties of these languages under various language-theoretic operations and we study the descr...
متن کاملIncomplete Transition Complexity of Basic Operations on Finite Languages
The state complexity of basic operations on finite languages (considering complete DFAs) has been extensively studied in the literature. In this paper we study the incomplete (deterministic) state and transition complexity on finite languages of boolean operations, concatenation, star, and reversal. For all operations we give tight upper bounds for both descriptional measures. We correct the pu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017